A Multigrid Method Based on Incomplete Gaussian Elimination

نویسنده

  • Arnold Reusken
چکیده

In this paper we introduce and analyze a new Schur complement approximation based on incomplete Gaussian elimination. The approximate Schur complement is used to develop a multigrid method. This multigrid method has an algorithmic structure that is very similar to the algorithmic structure of classical multigrid methods. The resulting method is almost purely algebraic and has interesting robustness properties with respect to variation in problem parameters. AMS Subject Classification: 62N20, 65N30, 65N55.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An approximate cyclic reduction multilevel preconditioner for general sparse matrices

We discuss an iterative method for solving large sparse systems of equations. A hybrid method is introduced which uses ideas both from ILU preconditioning and from multigrid. The resulting preconditioning technique requires the matrix only. A multilevel structure is obtained by using maximal independent sets for graph coarsening. For Schur complement approximation on coarser graphs an incomplet...

متن کامل

Computing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process

In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...

متن کامل

An Evaluation of Parallel Multigrid as a Solver and a Preconditioner for Singularly Perturbed Problems

In this paper we try to achieve h-independent convergence with preconditioned GMRES ([Y. Saad and M. H. Schultz, SIAM J. Sci. Comput., 7 (1986), pp. 856–869]) and BiCGSTAB ([H. A. Van der Vorst, SIAM J. Sci. Comput., 13 (1992), pp. 63–644]) for two-dimensional (2D) singularly perturbed equations. Three recently developed multigrid methods are adopted as a preconditioner. They are also used as s...

متن کامل

Solution of Linear Systems Using Randomized Rounding

This paper gives an algorithm for solving linear systems, using a randomized version of incomplete LU factorization together with iterative improvement. The factorization uses Gaussian elimination with partial pivoting, and preserves sparsity during factorization by randomized rounding of the entries. The resulting approximate factorization is then applied to estimate the solution. This simple ...

متن کامل

Non - nested and non - structured multigrid methods applied to elastic problems . Part II : The three - dimensional case

Aspects of non-nested and non-structured multigrid methods with applications to twodimensional elastic problems were presented in a companion paper [5] by the current authors, Non-Nested and Non-Structured Multigrid Methods Applied to Elastic Problems, Part I: The Two-Dimensional Case. In this paper a review of some multigrid strategies, procedures for geometric search to implement transfer ope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1996